On finding the minimum bandwidth of interval graphs
نویسندگان
چکیده
منابع مشابه
On Finding the Minimum Bandwidth of Interval Graphs
Let G = (V, E) be an interval graph, with 1 VI = n, and IE] = m. An O(n’ log n) algorithm was proposed in Kratsch (Inform Compui. 74, 14O158 (1987)) to find the bandwidth of G. We show that this algorithm is wrong, and provide a corrected version of the same. Also, it was observed in [4] that the bandwidth of a proper inferual graph can be computed in O(n log n + m) time. We show how this idea ...
متن کاملOn the bandwidth of Mobius graphs
Bandwidth labelling is a well known research area in graph theory. We provide a new proof that the bandwidth of Mobius ladder is 4, if it is not a $K_{4}$, and investigate the bandwidth of a wider class of Mobius graphs of even strips.
متن کاملon the bandwidth of mobius graphs
bandwidth labelling is a well known research area in graph theory. we provide a new proof that the bandwidth of mobius ladder is 4, if it is not a $k_{4}$, and investigate the bandwidth of a wider class of mobius graphs of even strips.
متن کاملThe minimum linear arrangement problem on proper interval graphs
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 Preliminaries Let F be a family of nonempty sets. The intersection graph of F is obtained by representing each set in F by a vertex and connecting two vertices by an edge if and only if their corresponding sets interse...
متن کاملA Brooks-type Theorem for the Bandwidth of Interval Graphs
Let G be an interval graph. The layout that arranges the intervals in order by right endpoint easily shows that the bandwidth of G is at most its maximum degree ∆. Hence, if G contains a clique of size ∆ + 1, then its bandwidth must be ∆. In this paper we prove a Brooks-type bound on the bandwidth of interval graphs. Namely, the bandwidth of an interval graph is at most ∆, with equality if and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1991
ISSN: 0890-5401
DOI: 10.1016/0890-5401(91)90045-4